Numerical approximations of chromatographic models
نویسندگان
چکیده
منابع مشابه
Exponential Models: Approximations for Probabilities
Welch & Peers (1963) used a root-information prior to obtain posterior probabilities for a scalar parameter exponential model and showed that these Bayes probabilities had the confidence property to second order asymptotically. An important undercurrent of this indicates that the constant information reparameterization provides location model structure, for which the confidence property ...
متن کاملTheory and Numerical Approximations
We consider a nonlinear Dirac system in one space dimension with periodic boundary conditions. First, we discuss questions on the existence and uniqueness of the solution. Then, we propose an implicit-explicit finite difference method for its approximation, proving optimal order a priori error estimates in various discrete norms and showing results from numerical experiments.
متن کاملGenerating Numerical Approximations
We describe a computational model for planning phrases like “more than a quarter” and “25.9 per cent” which describe proportions at different levels of precision. The model lays out the key choices in planning a numerical description, using formal definitions of mathematical form (e.g., the distinction between fractions and percentages) and roundness adapted from earlier studies. The task is mo...
متن کاملNumerical simulation of an optical chromatographic separator.
Optical chromatography achieves microscale optical manipulation through the balance of optical and hydrodynamic forces on micron sized particles entrained in microfluidic flow traveling counter to the propagation of a mildly focused laser beam. The optical pressure force on a particle is specific to each particle's size, shape and refractive index. So far, these properties have been exploited i...
متن کاملComputing Inner Approximations of Numerical MaxCSP
Classically, inner-approximation techniques guarantee soundness over a conjunction of numerical non-linear constraints. These techniques do not offer obvious extensions to manage such problems as solving numerical MaxCSPs. In this paper, we present an algorithm to compute inner approximations of numerical MaxCSPs. Our approach guarantees a complete and sound exploration of the search space and ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Numerical Methods for Partial Differential Equations
سال: 2021
ISSN: 0749-159X,1098-2426
DOI: 10.1002/num.22792